/**
*      author: Y_Yao
*      created: 2025-03-01 12:54:53
**/

#include<bits/stdc++.h>

#define int LL
using namespace std;
using LL = long long;
const LL LLINF = 1e18;
const int INF = 0x3f3f3f3f;
const int N = 2e5 + 7;
pair<int,int> a[N];

void solve()
{
    int n;
    cin >> n;
    for(int i = 1;i <= n;i++)
    {
        int x,y;
        cin >> x >> y;
        a[i] = {y,x};
    }
    sort(a + 1,a + 1 + n);
    int cur = 0;
    for(int i = 1;i <= n;i++)
    {
        cur += a[i].second;
        if(cur > a[i].first)
        {
            cout << "No" << endl;
            return;
        }
    }
    cout << "Yes" << endl;
}

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    //cin >> t;
    while(t--)
    {
        solve();
    }
    return 0;
}